Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
421	A Refined Complexity Analysis of Degree Anonymization in GraphsI Sepp Hartunga , Andr´e Nichterleina , Rolf Niedermeiera , Ondˇrej Such´ yb a Institut Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-09-29 07:15:40 NP-complete problems Kernelization Graph coloring Clique Independent set Degree Neighbourhood Degeneracy Parameterized complexity Graph theory Theoretical computer science Mathematics
422	Monotonicity testing over general poset domains [Extended Abstract] Eldar Fischer Eric Lehman Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2004-02-03 12:29:43 Bipartite graph Tree decomposition Graph Aanderaa–Karp–Rosenberg conjecture Edge coloring Graph theory Mathematics Clique
423	RTF Document Add to Reading List Source URL: abs.gov.au Language: English - Date: 2014-08-14 21:33:49 Graph coloring Planar graphs Graph theory Mathematics Logarithms
424	k-Cographs are Kruskalian Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-16 14:46:21 Distance-hereditary graph Neighbourhood Clique Minor Induced path Graph coloring Graph Tree Path decomposition Graph theory Graph operations Cograph
425	Longest Paths in Planar DAGs in Unambiguous Log-Space Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:29:35 Directed acyclic graph Shortest path problem Graph coloring Planarity testing Tree Matroid theory Path decomposition Chromatic polynomial Graph theory Planar graphs Network theory
426	Hardness of the Covering Radius Problem on Lattices Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-12-09 15:48:28 Graph coloring Graph Combinatorial optimization Gomory–Hu tree Graph theory Mathematics Theoretical computer science
427	Incremental List Coloring of Graphs, Parameterized by ConservationI Sepp Hartunga , Rolf Niedermeiera a Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-22 17:08:40 Graph coloring NP-complete problems List coloring Parameterized complexity Kernelization Vertex cover Independent set Edge coloring Complete coloring Graph theory Theoretical computer science Mathematics
428	Edge-Selection Heuristics for Computing Tutte Polynomials David J. Pearce Computer Science Group, Victoria University of Wellington, New Zealand Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:30:57 Graph coloring Polynomials Tutte polynomial Chromatic polynomial Matching Graph property Cycle space Graph Pseudoforest Graph theory Mathematics Matroid theory
429	Guaranteed Scheduling for Switches with Configuration Overhead Brian Towles and William J. Dally Abstract— In this paper we present three algorithms that provide performance guarantees for scheduling switches, such as Add to Reading List Source URL: cva.stanford.edu Language: English - Date: 2005-12-01 13:38:04 Switches Analysis of algorithms Scheduling algorithms Computational complexity theory Scheduling Speedup Time complexity Graph coloring Crossbar switch Theoretical computer science Applied mathematics Mathematics
430	Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-03-13 14:59:55 NP-complete problems Graph partition Clique Graph coloring Vertex Connected component Breadth-first search Connectivity Tree Graph theory Theoretical computer science Mathematics

UPDATE